A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
نویسندگان
چکیده
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O∗(2 K 6.2158 ) for Max2-Sat (each clause contains at most 2 literals), where K is the number of clauses. The run time has been achieved by using heuristic priorities on the choice of the variable on which we branch. The implementation of these heuristic priorities is rather simple, though they have a significant effect on the run time. Also the analysis uses a non-standard measure.
منابع مشابه
Improved Bounds for Exact Counting of Satisfiability Solutions
An algorithm is presented for exactly solving (in fact, counting) the number of maximum weight satisfying assignments of a 2-SAT formula. The worst case running time of O(1.2461) for formulas with n variables improves on the previous bound of O(1.2561) by Dahllöf, Jonsson, and Wahlström. The weighted 2-SAT counting algorithm can be applied to obtain faster algorithms for combinatorial counting ...
متن کاملNew Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree
MAX-2-SAT and MAX-2-CSP are important NP-hard optimization problems generalizing many graph problems. Despite many efforts, the only known algorithm (due to Williams) solving them in less than 2 steps uses exponential space. Scott and Sorkin give an algorithm with 2 2 d+1 ) time and polynomial space for these problems, where d is the average variable degree. We improve this bound to O∗(2 10/3 d...
متن کاملExact Max 2-Sat: Easier and Faster
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, counting) weighted Max 2-Sat instances. One of them has a good performance if the underlying constraint graph has a small separator decomposition, another has a slightly improved worst case performance. For a 2-Sat inst...
متن کاملExact Max-SAT solvers for over-constrained problems
We present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then p...
متن کاملSolving Over-Constrained Problems with SAT Technology
We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then present two Max-SAT solvers that find...
متن کامل